Code Based Hashing Technique for Message Authentication Algorithms

In Cryptography, hash functions play a fundamental role in mapping messages into hash codes, where hash codes are served as compact representative of input messages. The hash function is a many-to-one function. Same hash function can be generated from different input messages, implying that the existence of collisions. Cryptographic hash functions are used for data integrity in conjunction with digital signature schemes, where a message is hashed first, and then the hash-value is used as a representative of the message, and is signed in place of the original message. Keyed hash functions whose specific purpose is message authentication are called message authentication code (MAC) algorithms. In this paper, we use the NMACA technique that is proposed in a previous paper, where the MAC key is used in building the hash functions by defining the order for accessing source words and defining the number of bit positions for left shifts. Our main contribution is using a new hashing technique that is based on language interpreters. In other words, our hash function is dynamic and depends on the code being hashed, and is not fixed as in the case of most hash functions used in cryptography. The used language interpreters are used in accordance with a secret key to form a fast robust MAC algorithm. A language and an interpreter induced from the input message will be defined while the key will be used also to permute the input message.